Packet Delivery Research Articles

Intelligent Packet Priority Module for a Network of Unmanned Aerial Vehicles Using Manhattan Long Short-Term Memory

Unmanned aerial vehicles (UAVs) are becoming more common in wireless communication networks. Using UAVs can lead to network problems. An issue arises when the UAVs function in a network-access-limited environment with nodes causing interference. This issue could potentially hinder UAV network connectivity. This paper introduces an intelligent packet priority module (IPPM) to minimize network latency. This study analyzed Network Simulator–3 (NS-3) network modules utilizing Manhattan long short-term memory (MaLSTM) for packet classification of critical UAV, ground control station (GCS), or interfering nodes. To minimize network latency and packet delivery ratio (PDR) issues caused by interfering nodes, packets from prioritized nodes are transmitted first. Simulation results and evaluation show that our proposed intelligent packet priority module (IPPM) method outperformed previous approaches. The proposed IPPM based on MaLSTM implementation for the priority packet module led to a lower network delay and a higher packet delivery ratio. The performance of the IPPM averaged 62.2 ms network delay and 0.97 packet delivery ratio (PDR). The MaLSTM peaked at 97.5% accuracy. Upon further evaluation, the stability of LSTM Siamese models was observed to be consistent across diverse similarity functions, including cosine and Euclidean distances.

Fuzzy inference logic assisted rendezvous points based effective routing strategy in wireless sensor networks

SummaryIn this proposed strategy, an effective routing strategy is introduced for routing based on Rendezvous Points assisted fuzzy inference logics. First, sensor nodes in the cluster are created using the mean‐shift clustering mechanism (MS‐ClusT). A cluster head is selected for the clusters to gather aggregated data from the nodes of clusters. The cluster head selection is done using the Manta Ray optimization‐assisted modified network‐based fuzzy inference logic (MMFiL) approach. Rendezvous points are then selected for routing to minimize the delay and energy consumption for visiting all cluster heads. The rendezvous points are used to define the shortest route for routing. The shortest path from clusters to the base station by selecting rendezvous points is implemented using an integrated neural network with an Archer‐Fish optimization algorithm (InnAFo). In the end, the performance attained by the model is compared with the results of the classical strategy and returns a 0.976563 packet delivery rate and 0.029297 loss rate in 500 nodes. Furthermore, the throughput attained by the proposed model is 0.992874 Mbps, and the delay is 67.30 ms at 500 nodes. The analysis of the proposed model will result in less time needed for cluster head selection.

Efficient malicious node detection by multi-objective energy trust aware hybrid optimization based maximizing lifetime of wireless sensor networks

Wireless sensor network (WSN) collect and detect data in real time, but their battery life limits their lifetime. The CH selection process increases network overhead and reduces lifetime, but it considers node processing and energy limitations. To solve that problem this research methodology proposed Multi Objective Energy trust - Aware Optimal Clustering and Secure Routing (MOETAOCSR) protocol. At first, the trust factors such as direct and indirect factors are calculated. Thus, the calculated values are given as input to the SDLSTM to detect the malicious node and normal node. Here, the network deployment process is initially carried out and then the cluster is formed by HWF-FCM. From the clustered sensor nodes, the cluster head is selected using Golden Jackal Siberian Tiger Optimization (GJSTO) approach. Then, the selection of CH the paths are learned by using the Beta Distribution and Scaled Activation Function based Deep Elman Neural Network (BDSAF-DENN) and from the detected paths the optimal paths are selected using the White Shark Optimization (WSO). From the derived path sensed data securely transferred to the BS for further monitoring process using FPCCRSA. The proposed technique is implemented in a MATLAB platform, where its efficiency is assessed using key performance metrics including network lifetime, packet delivery ratio, and delay. Compared to existing models such as EAOCSR, RSA, and Homographic methods, the proposed technique achieves superior results. Specifically, it demonstrates a 0.95 improvement in throughput, 0.8 enhancement in encryption time, and a network lifetime of 7.4.

Advancing Healthcare Networks: Optimizing Multi-Objective RPL for Diverse Traffic in Low-Power, Lossy Environments

RPL: Powering modern healthcare IoT Networks. The Routing Protocol for Low Power and Lossy Networks(RPL) is a protocol specifically designed for routing in networks characterized by low power and lossy connections built on IPv6. It is specifically designed for the growing use of Instantaneous IoT (Internet of Things) applications. These networks cater to the specialized requirements of Low Power (resource-constrained) and Lossy Networks(unstable networks), also known as LLNs, where routing data smoothly and prioritizing traffic types are the significant challenges. Studies have shown that standard RPL, which makes use of a set of routing rules, struggles to provide the level of performance that many IoT applications in modern-day healthcare demand. This limits RPL’s potential in scenarios where we have a mix of data traffic, which is very common in healthcare settings. To handle the diverse data traffic found in healthcare settings, our method involves distributing several instances of RPL settings throughout the network. The main objective of this strategy is to improve the effectiveness of important and critical healthcare applications. We have developed and thoroughly tested our system using Contiki, which is an open-source IoT operating system. We have three instances in our MultiInstance RPL setup, each of which is intended to handle different kinds of network traffic and provide varying Quality of Service (QoS) measures. Different sets of Objective Function (OF) rules are used by each instance to decide which route is optimal for the data it processes. We have made use of OF0 (Objective Function 0) and MRHOF (Minimum Rank with Hysteresis Objective Function). We have rigorously tested our solution. Our focus has been on metrics like delay, average energy consumption and Packet Delivery Ratio (PDR). Compared to standard RPL, our approach improved packet delivery rates and significantly reduced delays for high priority data packets. This research shows how to better address the complex data traffic needs of real-time healthcare IoT networks.

Artificial self-attention rabbits battle royale multiscale network based robust and secure data transmission in mobile Ad Hoc networks

In a Mobile Ad hoc Network (MANET), the network structure constantly evolves due to the movement of devices, users, or nodes. The Black Hole Attack (BHA) is recognized as the most impactful threat in MANETs, where an attacker node intentionally discards all data traffic, hence minimizing the network performance. Therefore, developing a secure and robust routing protocol is vital for efficient data transmission in a MANET. Although existing solutions have been designed to counteract malicious nodes, these solution presents drawbacks such as the need for additional hardware, notable delivery delays, limited throughput, increased energy consumption, and minimum packet delivery ratio. Thus, this research work introduces a new updated Ad hoc On-demand Distance Vector (AODV) routing protocol that integrates the benefits of the Artificial Rabbits Battle Royale Optimization (ARBRO), and Self-attention Multiscale Network (SMNet). The role of the ARBRO algorithm is to optimize the route by selecting the most appropriate node properties. Then, SMNet identifies the BHA node using these node properties. The proposed scheme is implemented in MATLAB. Experimental results determines that the introduced approach attains a delay of 0.039 s, a throughput of 94.57 Kbps, and a packet delivery ratio of 98.76 %, which are better than the existing techniques. Simulation results demonstrate that the introduced method improves network performance by enhancing the quality of service in the presence of a BHA.

Multiple-Junction-Based Traffic-Aware Routing Protocol Using ACO Algorithm in Urban Vehicular Networks.

The burgeoning interest in intelligent transportation systems (ITS) and the widespread adoption of in-vehicle amenities like infotainment have spurred a heightened fascination with vehicular ad-hoc networks (VANETs). Multi-hop routing protocols are pivotal in actualizing these in-vehicle services, such as infotainment, wirelessly. This study presents a novel protocol called multiple junction-based traffic-aware routing (MJTAR) for VANET vehicles operating in urban environments. MJTAR represents an advancement over the improved greedy traffic-aware routing (GyTAR) protocol. MJTAR introduces a distributed mechanism capable of recognizing vehicle traffic and computing curve metric distances based on two-hop junctions. Additionally, it employs a technique to dynamically select the most optimal multiple junctions between source and destination using the ant colony optimization (ACO) algorithm. We implemented the proposed protocol using the network simulator 3 (NS-3) and simulation of urban mobility (SUMO) simulators and conducted performance evaluations by comparing it with GSR and GyTAR. Our evaluation demonstrates that the proposed protocol surpasses GSR and GyTAR by over 20% in terms of packet delivery ratio, with the end-to-end delay reduced to less than 1.3 s on average.

Network Analysis of Decentralized Fault-Tolerant UAV Swarm Coordination in critical Missions

Unmanned Aerial Vehicles (UAVs) have gained prominence across various sectors for their versatile applications. While their advantages are evident, addressing concerns associated with their deployment is essential to ensure reliability. This study presents an innovative approach for coordinating a group of UAVs in aerial survey missions. The decentralized strategy presented in this article allow UAVs to self-organize into linear formation, optimize their coverage paths, and adapt to agent failures, thereby ensuring efficient and adaptive mission execution. The strategy has been tested and validated on two different platforms: the inter-UAV communication performance is evaluated on NS-3 simulator to measure metrices such as packet delivery ratio, throughput, delay, and routing overhead within the UAV swarms, while mission efficiency and fault tolerance is analyzed on ROS framework, and visualized on Gazebo simulator with real-time parameters. Through experimental results, we show that, after proper tuning of control parameters, the approach succeeds in flock formation with high level of fault tolerance, offering higher efficiency in terms of mission time, transmission delay, packet delivery rate, and control overhead, when compared to the benchmark approaches.

Design of CSKAS-VANET model for stable clustering and authentication scheme using RBMA and signcryption

A public key infrastructure-enabled system authentication model is developed to provide essential security functions for Vehicular ad hoc networks (VANETs). An intelligent transportation system is provided by VANET, an emerging technology. Dedicated short-range communication is used to disseminate messages wirelessly. Communications may be hacked, and messages can be stolen or fabricated. Hence, authenticated communication is crucial in the VANET environment. Some parameters such as trust, authentication, privacy, and security are at high risk. This article suggests a VANET with secure authentication and trust-based clustering mechanisms to provide stable and secure communication. Initially, the Restricted Boltzmann Machine learning algorithm (RBMA) is used to select the cluster head, which depends upon trust, vehicle lifetime, and buffer level. Then, cluster members are formed, followed by grouping. Diffie–Hellman Hyperelliptic Curve Cryptography and cryptographic hash functions are used by signcryption for secure communication in VANET. Therefore, the essential component of the key agreement strategy that will give superior authentication is this signcryption mechanism. Over the medium access protocol layer, all of these security characteristics are updated. The proposed method of clustering signcryption key agreement scheme (CSKAS) approach reduces time complexity and increases packet delivery ratio which is vital in providing stable, secure communication.

A hybrid framework for routing and channel assignment in WMN’s

Wireless mesh network (WMNs) can replace the physical existence of wired network; nevertheless, to solve the problem of traffic and congestion, they must carefully arrange radio resource assignment. In this paper, we focus on the major issues while transferring the data over the network and optimization of resources. WMN mainly suffers from congestion problem when numbers of channel transfer data at a same time which indirectly leads to overlapping channels and sometime data cannot be mitigated to destination. To overcome this problem and provide optimal solution we proposed hybrid channel assignment technique which offers four phase solution technique, in this technique firstly by mitigating the traffic than assigning the optimal path based on greedy and BFS. The purpose of this congestion control hybrid ant based greedy-BFS-load balancing (CCHAGBL) technique is to diminish the number of used slots, which is directly related to the overall resource assignment. We also provide optimal solution using Ant colony optimization technique with hybrid algorithm to achieve the network efficiency and resource utilization with randomly generated traffic. With the help of hybrid ant based greedy-BFS-load balancing (GBL) channel assignment algorithm throughput and packet delivery ratio is upgraded and delay is reduced to minimum.

Fuzzy-AHP based optimal RSU deployment (Fuzzy-AHP-ORD) approach using road and traffic analysis in VANET

Vehicular Ad Hoc Network (VANET) is a proven technology in Intelligent Transportation Systems (ITS) that provides various safety and non-safety applications. The Roadside Unit (RSU) is one of the essential components of the VANET, which allows vehicles to disseminate and exchange safety and infotainment information in a broader range. RSUs are also valuable for offloading the internet data traffic of vehicular users from cellular networks. However, due to high deployment and maintenance costs and security overhead, it is essential to optimally deploy these RSUs and place them in prominent places to increase the overall network coverage and efficiency. The existing deployment strategies either analyzed the road network on one or a few topological parameters or vehicular traffic parameters and considered equal or random weights for each parameter. None of them deal with the uncertainty of parameter weightage. Thus, this paper proposes a Fuzzy-Analytic Hierarchy Process-based optimal RSU deployment (Fuzzy-AHP-ORD) approach to finding the highly influential intersection nodes for RSU deployment. The Fuzzy-AHP-ORD considers different static and dynamic parameters concerning road topology and the vehicle’s traffic behavior. The weights of the parameter are calculated through Fuzzy-AHP, then the various intersection nodes of the road networks are ranked using the TOPSIS (Technique for Order of Preference by Similarity to Ideal Solution) based MADM (Multiple Attribute Decision Making) method. The simulation results reveal the effectiveness of the proposed method in comparison to other benchmark methods in terms of coverage ratio, connection time, packet delivery ratio, and delay.

An Underwater Source Location Privacy Protection Scheme Based on Game Theory in a Multi-Attacker Cooperation Scenario.

Ensuring source location privacy is crucial for the security of underwater acoustic sensor networks amid the growing use of marine environmental monitoring. However, the traditional source location privacy scheme overlooks multi-attacker cooperation strategies and also has the problem of high communication overhead. This paper addresses the aforementioned limitations by proposing an underwater source location privacy protection scheme based on game theory under the scenario of multiple cooperating attackers (SLP-MACGT). First, a transformation method of a virtual coordinate system is proposed to conceal the real position of nodes to a certain extent. Second, through using the relay node selection strategy, the diversity of transmission paths is increased, passive attacks by adversaries are resisted, and the privacy of source nodes is protected. Additionally, a secure data transmission technique utilizing fountain codes is employed to resist active attacks by adversaries, ensuring data integrity and enhancing data transmission stability. Finally, Nash equilibrium could be achieved after the multi-round evolutionary game theory of source node and multiple attackers adopting their respective strategies. Simulation experiments and performance evaluation verify the effectiveness and reliability of SLP-MACGT regarding aspects of the packet forwarding success rate, security time, delay and energy consumption: the packet delivery rate average increases by 30%, security time is extended by at least 85%, and the delay is reduced by at least 90% compared with SSLP, PP-LSPP, and MRGSLP.

“Clustering Protocol Based on Territorial Energy for Random Deployment of Wireless Sensor Networks"

Wireless Sensor Networks (WSNs) have become increasingly essential for monitoring and gathering data in diverse environments. The efficient utilization of energy resources is crucial for prolonging the network lifetime in WSNs. This paper presents a comparative analysis of three prominent clustering protocols: Low Energy Adaptive Clustering Hierarchy (LEACH), Residual Energy Aware Clustering (REAC), and Territorial Energy-Driven Clustering Protocol (TEDC). TEDC introduces a novel approach where cluster heads are elected based on territorial dominance and energy levels, aiming to enhance energy efficiency and prolong network lifetime. The performance of LEACH, REAC, and TEDC is evaluated under various scenarios, including node density, network size, and communication range. Key performance metrics such as energy consumption, network lifetime, and packet delivery ratio are analyzed to assess the effectiveness of each protocol. The results provide valuable insights into the comparative strengths and weaknesses of these protocols, aiding network designers and researchers in selecting the most suitable protocol for specific WSN deployments. Additionally, the paper discusses potential optimizations and future research directions to further enhance the performance of clustering protocols in WSNs.    

Detection of black hole attacks in vehicle-to-vehicle communications using ad hoc networks and on demand protocols

PurposeThe potential of vehicle ad hoc networks (VANETs) to improve driver and passenger safety and security has made them a hot topic in the field of intelligent transportation systems (ITSs). VANETs have different characteristics and system architectures from mobile ad hoc networks (MANETs), with a primary focus on vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication. But protecting VANETs from malicious assaults is crucial because they can undermine network security and safety.Design/methodology/approachThe black hole attack is a well-known danger to VANETs. It occurs when a hostile node introduces phony routing tables into the network, potentially damaging it and interfering with communication. A safe ad hoc on-demand distance vector (AODV) routing protocol has been created in response to this issue. By adding cryptographic features for source and target node verification to the route request (RREQ) and route reply (RREP) packets, this protocol improves upon the original AODV routing system.FindingsThrough the use of cryptographic-based encryption and decryption techniques, the suggested method fortifies the VANET connection. In addition, other network metrics are taken into account to assess the effectiveness of the secure AODV routing protocol under black hole attacks, including packet loss, end-to-end latency, packet delivery ratio (PDR) and routing request overhead. Results from simulations using an NS-2.33 simulator show how well the suggested fix works to enhance system performance and lessen the effects of black hole assaults on VANETs.Originality/valueAll things considered, the safe AODV routing protocol provides a strong method for improving security and dependability in VANET systems, protecting against malevolent attacks and guaranteeing smooth communication between cars and infrastructure.

Enhancing Quality of Service and Energy Efficiency in Wireless Sensor Networks through TDMA-Based Topology and Cross-Layer Approaches

It is necessary to continuously monitor the environment with the sensors in delay-sensitive wireless sensor network applications. The continuous monitoring operation results in higher energy consumption by the sensor nodes; wireless sensor networks are also subject to numerous difficulties, including latency, packet loss, and throughput. These are the most important constraints in wireless sensor networks (WSNs) and need to improve for better quality communication. In this research, quality of service is related to numerous systems that have very sensitive parameters such as end-to-end delay, packet loss, throughput, energy consumption, latency, and average delay. Therefore, it is necessary for the sensors to transmit reliable data within a reasonable timeframe. To find out better communication results, we have used the TDMA (Time Division Multiple Access) approaches in our paper to improve packet delivery ratio (PDR), latency, and throughput. The NS2 simulator is used to test communication between nodes. Latency, the packet delivery ratio (PDR) of transferring data packets, and throughput are measured. The TDMA approach is used in our proposed topology, and we can see a specific area where nodes are connected to communicate with one another. Each node is communicating with the other node using two different paths. Each node's bandwidth, latency, and PDR will be different. Hence, in one path, a TDMA approach is implemented, which results in improved node performance in terms of latency, packet delivery ratio, and bandwidth.

UAV-enabled software defined data collection from an adaptive WSN

AbstractUnmanned aerial vehicle (UAV)-based data gathering from wireless sensor networks is one of the recent research topics that has currently attracted research interest. One of the challenges for the UAV-aided WSN data collection efforts is to design an energy-efficient UAV/drone communication with arbitrarily dispersed ground sensors by improving the ground network structure. This paper aims to develop a technique titled UAV Fuzzy Travel Path' that supports UAV smooth path design and enables ground network topology shifting. A comprehensive UAV-based data collection model is proposed to enable dynamic orchestration/re-orchestration of wireless ground sensors to jointly improve network performance and UAV path fluidity. This provides a more flexible ground network framework that can be restructured based on network demands and UAV optimal paths, effectively allowing for a software-defined network concept. The main contribution of this work is the implementation of the software-defined wireless sensor network on the ground network that adaptably supports the movement of the UAV and enhances the communication network’s energy efficiency with a proposed latency analytical analysis via network orchestration/re-orchestration phases. The main significance of this research is in offering a flexible span for UAV path design than being fixed in one strict route for data gathering purposes. Four various simulation tools are employed for modelling and performance evaluation, namely MATLAB, CupCarbon, Contiki-Cooja and Mission Planner. The proposed software-defined ground network system demonstrates encouraging results in terms of network performance metrics including energy consumption of UAV versus ground sensor nodes energy usage, packet delivery rate, and the communication time of the ground orchestrated or/and re-orchestrated network.

Scheduling based on residual energy of sensors to extend the lifetime of network in wireless sensor network

The maximum amount of sensor energy is consumed during broadcasting. Hence in order to make delay with the network lifetime of a wireless sensor network (WSN), there is a need of optimum utilization of sensor energy. Scheduling in media access control (MAC) layer plays a critical role in the designing of WSN to avoid collision and conserve more energy. The Distributed energy aware MAC (DE-MAC) is one such efficient and feasible MAC protocol that addresses the energy management issues in WSN. This work proposes an extension of DE-MAC framework by allocating varying period slots to the nodes based on their residual energy level. Energy of all the nodes is exchanged at regular intervals. Accordingly, the nodes with low energy are allocated less time slots for broadcast and are made to sleep for more time. Simulation is carried out using NS2 (network simulator 2) and the efficiency and performance results are compared with DE-MAC for analysis. Improvement in performance for various parameters such as residual energy, throughput, and packet delivery ratio can be observed.

Enhancing security in wireless sensor networks: A fusion of deep learning and energy-efficient routing

The development of tiny sensing nodes efficient for wireless communication in Wireless Sensor Networks (WSNs) can be attributed to the rapid advancements in processors and radio technology. Data transmission occurs through multi-hop routing in WSN, which relies on nodes’ cooperation. The collaboration between nodes has rendered these networks susceptible to various attacks. It is imperative to employ a security scheme to evaluate the dependability of nodes in distinctive malicious nodes from non-malicious nodes. In recent years, there has been a growing significance placed on security-based routing protocols with energy constraints as valuable mechanisms for enhancing the security and performance of WSNs. A novel solution called the Deep Learning-based Hybrid Energy Efficient and Security System (DL-HE2S2) is introduced to address these challenges. The research workflow encompasses various essential stages, namely the deployment of nodes, the creation of clusters, the selection of cluster heads, the detection of malevolent nodes within each group, and the determination of optimal paths intra- and inter-clusters employing the routing algorithm for efficient packet transmission. The design of the algorithm is focused on achieving energy efficiency and enhancing network security while also taking into account various performance metrics, including a mean network lifetime of 187.244 hours, a throughput of 59.88 kilobits per second, an end-to-end latency of 11.939 milliseconds, a packet loss of 14.9%, a packet delivery ratio of 99.194%, network security at 92.026%, and energy usage of 19.424 J. This research examines the algorithm’s scalability and efficiency across various network sizes using a Network Simulator (NS-2). DL-HE2S2 offers valuable insights that can be applied to practical implementations in multiple applications.

Design of a load balancing Objective Function for RPL

Routing protocols for Internet of Things (IoT) play a major role in the performance of the network. The standard Routing Protocol for Low-Power and Lossy Networks (RPL) suffers from a number of limitations including congestion of higher-level nodes and unbalanced topology. This paper proposes a novel Objective Function called Load Balanced Minimum Rank with Hysteresis Objective Function (LB_MRHOF), which assigns child nodes to the most suitable parent in the topology. The Objective Function utilizes a weight of the Expected Transmission Count (ETX) and number of children to calculate the Composite ETX and Number of Children (CENOC) which estimates the load on each node. The attained CENOC is used to select the optimum parent for each node in the topology, where nodes with high CENOC are avoided in the parent selection process. The proposed Objective Function has been evaluated under random and hierarchical network topologies. In addition, the evaluation has investigated the influence of the number of nodes by testing for small, medium and large-scale networks. Results have shown that the proposed Objective Function outperforms MRHOF, OF_FUZZY and OF-EC in terms of Packet Delivery Ratio (PDR) and reduces nodal hop-count under all tested scenarios, with no compromise in energy consumption. They have also revealed that the best performance achieved by LB_MRHOF is attained under large-scale networks. The resulting network topology which is formed by the proposed Objective Function has shown improved balance and more depth.

An approach for offloading with multi-hop considerations in an RSU signal overlay setting

In recent years, significant advancements in vehicle technology have spurred growing interest in Vehicular Ad hoc Networks (VANETs). This interest is driven by concerns for road safety and the need to alleviate network congestion, leading to the emergence of Intelligent Transport Systems (ITS). ITS focuses on improving road traffic management and safety through the utilization of wireless and mobile network communication technologies. VANETs play a pivotal role within the realm of ITS, facilitating tasks such as enhancing road safety, traffic monitoring, and ensuring passenger comfort by mitigating accidents and congestion. These objectives rely on the timely and accurate delivery of data to vehicle agents and relevant authorities, facilitated by reliable VANETs and Road Signal Units (RSUs). Achieving this necessitates identifying optimal routes with minimal distance, high radio access, and quality-awareness levels. To address these objectives, this study proposes the utilization of the Congestion Network with Predicted K-means multi-hop RSU algorithm (CN-MHMR) to enhance vehicular networking and communication. This algorithm facilitates efficient node transfer from base nodes to destination nodes via the shortest and energy-efficient paths, thereby enabling viable and reliable vehicular communications. The performance of the proposed model was evaluated based on various metrics, including energy consumption, throughput, delay, packet delivery ratio, accuracy, precision, and recall values.

A novel swarm intelligence‐based fuzzy logic in efficient connectivity of vehicles

SummaryA vehicular ad hoc network (VANET) is a wireless network composed of a collection of mobility devices that link via a wireless channel without the need for permanent infrastructure or centralized administration. Multicasting is a method of sending data from a single node to multiple recipients at the same time. Because of its energizing network topology and constricted resources, a mobile ad hoc network (MANET) presents a number of issues. Because network execution measurements such as latency, bandwidth, throughput, and energy fluctuate so rapidly owing to node movement, these network properties in a wireless mobile ad hoc network are ambiguous. Because of the influence of these uncertainty issues, determining the top‐grade path from the originating node to a set of recipient nodes is challenging. In order to preserve network resources, we used a Swarm Intelligence‐based fuzzy logic strategy in this study that includes channel caliber factor and connection termination time to try to alleviate these uncertainty issues. This strategy integrates all of the network indicators available for the routes into an individual quantity named as fuzzy cost or cost of communication. The routes with the lowest fuzzy cost will be regarded optimum, and data will be delivered along this route from the originating point to a set of receivers. The simulation was carried out using NS‐3.38 and MATLAB, and the results reveal that the suggested protocol, HACOFLM, outperforms ODMRP, OFAODV, MAODV, and DFMCRP by means of packet delivery ratio, latency, control packet overhead, and throughput. DFMCRP outperforms MAODV by 3% to 6%, OFAODV by 13% to 19%, and ODMRP by 16% to 23%. According to HACOSMO, based on the number of vehicles and velocities, routing overhead is 7% to 10% less than DFMCRP, 9% to 13% less than MAODV, 17% to 29% less than OFAODV, and 22% to 36% less than ODMRP. It improvise throughput by 4% to 6% when contrasted to DFMCRP, 5% to 9% when contrasted to MAODV, 10% to 14% when contrasted to OFAODV, and 14% to 23% when contrasted to ODMRP.